A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic
نویسنده
چکیده
A publicly verifiable secret sharing (PVSS) scheme is a verifiable secret sharing scheme with the property that the validity of the shares distributed by the dealer can be verified by any party; hence verification is not limited to the respective participants receiving the shares. We present a new construction for PVSS schemes, which compared to previous solutions by Stadler and later by Fujisaki and Okamoto, achieves improvements both in efficiency and in the type of intractability assumptions. The running time is O(nk), where k is a security parameter, and n is the number of participants, hence essentially optimal. The intractability assumptions are the standard Diffie-Hellman assumption and its decisional variant. We present several applications of our PVSS scheme, among which is a new type of universally verifiable election scheme based on PVSS. The election scheme becomes quite practical and combines several advantages of related electronic voting schemes, which makes it of interest in its own right.
منابع مشابه
A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملA Publicly Verifiable Secret Sharing Scheme Based on Multilinear Diffie-Hellman Assumption
Using multiple linear of multilinear map, we propose a simple, non-interactive and effective publicly verifiable secret sharing (PVSS) scheme based on multilinear DiffieHellman assumption (MDH). Up to now, the publicly verifiable of secret sharing is still an issue. In this paper, we set the sharing secret is a multiple linear pairing, we apply the multiple linear property of multilinear map fo...
متن کاملAn Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملAn Off-Line Electronic Payment Scheme based on Publicly Verifiable Secret Sharing
In this paper, we introduce a new efficient technique allowing to render an off-line e-cash system traceable without need to a trusted party. The main idea is the use of the publicly verifiable secret sharing technique in order to revoke the anonymity of double spending users. The anonymity of honest users is still provided. Security analysis shows that the proposed technique does not undermine...
متن کاملPublicly Verifiable Secret Sharing Member-join Protocol For Threshold Signatures
Publicly verifiable secret sharing (PVSS) allows not only shareholders themselves but also everyone verify the shares of a secret distributed by a dealer. It has a lot of electronic applications. In this paper, we propose a publicly verifiable member-join protocol for threshold signatures. In our proposal, a new member can join a PVSS scheme to share the secret only with the help of old shareho...
متن کامل